PolyShard: Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously

Today's blockchain designs suffer from a trilemma claiming that no system can simultaneously achieve decentralization, security, and performance scalability. For current systems, as more nodes join the network, efficiency of (computation, communication, storage) stays constant at best. A leading idea for enabling blockchains to scale is notion sharding: different subsets handle portions blockchain, thereby reducing load each individual node. However, existing sharding proposals scaling by compromising on trust - corrupting in given shard will lead permanent loss corresponding portion data. In this paper, we settle demonstrating new protocol coded storage computation blockchains. particular, propose PolyShard: “polynomially sharding” scheme achieves information-theoretic upper bounds storage, throughput, well trust, thus truly scalable system. We provide simulation results numerically demonstrate improvement over state arts, scalability PolyShard Finally, discuss potential enhancements, highlight practical considerations building such